Counting Auxiliary Pushdown Automata and Semi-unbounded Arithmetic Circuits
نویسنده
چکیده
In the main theorem, we show how a NAuxPDA may be simulated efficiently by a uniform family of boolean circuits, which preserve the number of accepting paths in the NAuxPDA as the number of accepting subtrees in the boolean circuit. Our techniques simulate the NAuxPDA in novel way by considering the height and reversal bounds of an AuxPDA. Reversal bounded AuxPDA have been studied previously [BH 881.
منابع مشابه
Two Applications of Inductive Counting for Complementation Problems
Following the recent independent proofs of Immerman [SLAM J. Comput., 17 (1988), pp. 935-938] and Szelepcs6nyi [Bull. European Assoc. Theoret. Comput. Sci., 33 (1987), pp. 96-100] that nondeterministic space-bounded complexity classes are closed under complementation, two further applications of the inductive counting technique are developed. First, an errorless probabilistic algorithm for the ...
متن کاملUnambiguous Simulations of Auxiliary Pushdown Automata and Circuits 3 (preliminary Version)
In this paper time-bounded auxiliary push-down automata (AuxPDA), i.e. time and space bounded Turing machines with additional pushdown store, are considered. We investigate the power of unambiguous AuxPDA, i.e., machines that have at most one accepting computation, and ambiguity bounded AuxPDA. Recently, it was shown by Buntrock, Hemachandra, and Siefkes that space bounded Turing machines, whos...
متن کاملUnambiguous Auxiliary Pushdown Automata and Semi-unbounded Fan-in Circuits
Notions of unambiguity for uniform circuits and AuxPDAs are studied and related to each other. In particular, a coincidence for counting and unambiguous versions of AuxPDAs and semi-unbounded fan-in circuits is shown. Moreover, an improved simulation of LOGUCFL (the class of languages logspace many-one reducible to unambiguous context-free languages) by unambiguous circuits and AuxPDAs is devel...
متن کاملCharacterizing the Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata
An alternating auxiliary pushdown hierarchy is defined by extending the machine model of the Logarithmic Alternation Hierarchy by a pushdown store while keeping a polynomial time bound. Although recently it was proven by Borodin et al. that the class of languages accepted by nondeterministic logarithmic space bounded auxiUary pushdown automata with a polynomial time bound is closed under comple...
متن کاملSymmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata1
We show that every language accepted by a nondeterministic auxiliary pushdown automaton in polynomial time (that is, every language in SAC 1 = Log(CFL)) can be accepted by a symmetric auxiliary pushdown automaton in polynomial time. Keywords-Symmetric Computation, Auxiliary Pushdown Automata, LogCFL, Reversible Computation
متن کامل